Some notes on iterated forcing with $2^{\aleph_0}>\aleph_2$.
نویسندگان
چکیده
منابع مشابه
Some results about (+) proved by iterated forcing
We shall show that the consistency of CH+¬(+) and CH+(+)+there are no club guessing sequences on ω1. We shall also prove that ♢ does not imply the existence of a strong club guessing sequence on ω1. §0. Introduction. The principle (+) and its variations were first considered by the second author in [2]. They are very weak club guessing principles. The properties of the principles were largely u...
متن کاملNotes on Forcing
1. Extensionality (definition of =): ∀x∀y (x = y iff ∀z z ∈ x iff z ∈ y). 2. Pairing (pairs exist): ∀x∀y∃z∀w (w ∈ z iff (w = x or w = y)). 3. Union (unions exist): ∀x∃z∀w (w ∈ z iff ∃y (w ∈ y and y ∈ x)). 4. Power set (power sets exist): ∀x∃z∀w(w ∈ z iff w ⊂ x). 5. Regularity (∀x (x,∈) has a minimal element): ∀x∃y (y ∈ x and y ∩ x = ∅). 6. Infinity (there is an infinite set): ∃x(x 6= ∅ and ∀y (...
متن کاملon some bayesian statistical models in actuarial science with emphasis on claim count
چکیده ندارد.
15 صفحه اولIterated Class Forcing
In this paper we develop the notion of \stratiied" class forcing and show that this property both implies coonality-preservation and is preserved by iterations with the appropriate support. Many Easton-style and Jensen-style forcings are stratiied, as are some more exotic forcings obtained by mixing these types together (see Easton 70], section 36 of Jech 78], Beller-Jensen-Welch 82], Friedman ...
متن کاملOn the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1987
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093637766